//https://leetcode.cn/problems/fibonacci-number/submissions/
package codeRandomThoughts.Test509斐波那契数;

public class Solution {
    public int fib(int n) {

        int[] dp = new int[n + 2];
        dp[0] = 0;
        dp[1] = 1;

        for (int i = 2; i < dp.length; i++) {
            dp[i] = dp[i - 1] + dp[i - 2];
        }

        return dp[n];
    }
}
